The Complex-Step Derivative Approximation on Matrix Lie Groups
نویسندگان
چکیده
منابع مشابه
Lie Algebras and Lie Brackets of Lie Groups–matrix Groups
The goal of this paper is to study Lie groups, specifically matrix groups. We will begin by introducing two examples: GLn(R) and SLn(R). Then in each section we will prove basic results about our two examples and then generalize these results to general matrix groups.
متن کاملExtended information filter on matrix Lie groups
In this paper we propose a new state estimation algorithm called the extended information filter on Lie groups. The proposed filter is inspired by the extended Kalman filter on Lie groups and exhibits the advantages of the information filter with regard to multisensor update and decentralization, while keeping the accuracy of stochastic inference on Lie groups. We present the theoretical develo...
متن کاملCooperative Cloud SLAM on Matrix Lie Groups
In this paper we present a Cooperative Cloud SLAM on Matrix Lie Groups (CLEARS), which enables efficient and accurate execution of simultaneous localization and environment mapping, while relying on integration of data from multiple agents. Such fused information is then used to increase mapping accuracy of every agent itself. In particular, the agents perform only computationally simpler tasks...
متن کاملGerbes on Complex Reductive Lie Groups
Let K be a compact Lie group with complexification G. We construct by geometric methods a conjugation invariant gerbe on G; this then gives by restriction an invariant gerbe on K. Our construction works for any choice of level. When K is simple and simply-connected, the level is just an integer as usual. For general K, the level is a bilinear form b on a Cartan subalgebra where b satisfies a qu...
متن کاملLeast-squares approximation by elements from matrix orbits achieved by gradient flows on compact lie groups
Let S(A) denote the orbit of a complex or real matrix A under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the best approximation of a given matrix A0 by the sum of matrices in S(A1), . . . , S(AN ) in the sense of finding the Euclidean least-squares distance min {‖X1 + · ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Robotics and Automation Letters
سال: 2020
ISSN: 2377-3766,2377-3774
DOI: 10.1109/lra.2020.2965882